import java.util.*;

/**
 * @author LKQ
 * @date 2022/5/8 17:40
 * @description
 */
public class Solution {
    public static void main(String[] args) {

    }
    int n, M, T;
    int[] m, t;
    int[][] dp;
    public void dp() {
        for (int k = 1; k <= n; k++) {
            // 对经费进行一层枚举
            for (int i = M; i >= m[i]; i--) {
                // 对时间进行一层枚举
                for (int j = T; j >= t[i]; j--) {
                    dp[i][j] = Math.max(dp[i][j], dp[i - m[i]][j - t[i]] + 1);
                }
            }

        }
    }

}
